Approximation Algorithms: LP Relaxation, Rounding, and Randomized Rounding Techniques
نویسنده
چکیده
منابع مشابه
Approximation Algorithms Based on Lp Relaxation 1 Linear Programs and Linear Integer Programs
There are two fundamental approximation algorithm design techniques based on linear programming: (a) LP-relaxation and rounding, and (b) the primal-dual method. In this lecture note, we will discuss the former. The idea of LP-relaxation and rounding is quite simple. We first formulate an optimization problem as an integer program (IP), which is like a linear program (LP) with integer variables....
متن کاملCS 787 : Advanced Algorithms LP - Based Approximations
We present methods for constructing approximation algorithms to NP-hard optimization problems using linear programming (LP). We typically obtain an LP relaxation of the problem by formulating it as an integer linear program and dropping the integrality constraints. We then solve the LP relaxation exactly, and apply various rounding strategies (including randomized rounding and iterative roundin...
متن کاملDistributed Combinatorial Optimization – Extended Abstract
Approximating integer linear programs by solving a relaxation to a linear program (LP) and afterwards reconstructing an integer solution from the fractional one is a standard technique in a non-distributed scenario. Surprisingly, the method has not often been applied for distributed algorithms. In this paper, we show that LP relaxation is a powerful technique also to obtain fast distributed app...
متن کاملApproximation Algorithms for the Single-Warehouse Multi-Retailer Problem With Piecewise Linear Cost Structures1
Recently, Chan et al. (2000) proposed an efficient heuristic for a class of finite time planning horizon single-warehouse multi-retailer system with complex (nonlinear) transportation cost structures. Their heuristic is based on solving a large LP relaxation of the underlying problem. In this paper, we analyze the strength of the proposed LP relaxation and show that it attains the best theoreti...
متن کاملOblivious Rounding and the Integrality Gap
The following paradigm is often used for handling NP-hard combinatorial optimization problems. One first formulates the problem as an integer program, then one relaxes it to a linear program (LP, or more generally, a convex program), then one solves the LP relaxation in polynomial time, and finally one rounds the optimal LP solution, obtaining a feasible solution to the original problem. Many o...
متن کامل